Search results for "Computer Science::Software Engineering"

showing 10 items of 11 documents

Data for: Analytical induced force solution in conducting cylindrical bodies and rings due to a rotating finite permanent magnet

2019

Implementation of analytical current density solution in numerical calculations using Wolfram Mathematica software. THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOVE

Analytical MethodComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONComputer Science::Mathematical SoftwareComputer Science::Software EngineeringElectromagneticsComputer Science::Symbolic ComputationInterdisciplinary sciencesOtherNonlinear Sciences::Cellular Automata and Lattice Gases
researchProduct

"Table 3" of "Search for supersymmetry using final states with one lepton, jets, and missing transverse momentum with the ATLAS detector in sqrt{s} =…

2011

Distribution of M(C=EFFECTIVE) IN GEV for data and background MC calculation.

Computer Science::Software EngineeringSUSY7000.0Jet ProductionNInclusiveProton-Proton ScatteringComputer Science::Programming LanguagesCondensed Matter::Strongly Correlated ElectronsHigh Energy Physics::ExperimentP P --> LEPTON+ JETS XP P --> LEPTON- JETS XSupersymmetryNuclear Experiment
researchProduct

Simple computation of the approximated modulation transfer function (MTF) using spreadsheet-software: method and evaluation in five maxillofacial CBC…

2019

OBJECTIVES: To develop a simple way to compute the approximated modulation transfer function (MTF) manually using conventional spreadsheet software. METHODS: Basing on an edge-image a method was developed, facilitating computation of the edge spread and line spread function in open-source spreadsheet software (Gnumeric; http://projects.gnome.org/gnumeric/downloads.shtml). By means of the integrated fast Fourier transformation Fourier coefficients are obtained from the line spread function which can then be plotted vs spatial frequency to obtain MTF-plots. For the experimental evaluation an edge test object was exposed in five commercial CBCT devices for maxillofacial applications. RESULTS: …

Computer science030218 nuclear medicine & medical imaging03 medical and health sciencessymbols.namesake0302 clinical medicineTechnical ReportSimple (abstract algebra)Optical transfer functionRadiography DentalHumansRadiology Nuclear Medicine and imagingGeneral DentistryDigital signal processingSimple computationbusiness.industrySpreadsheet softwarePhantoms ImagingComputer Science::Software EngineeringReproducibility of Results030206 dentistryGeneral MedicineSpiral Cone-Beam Computed TomographyRadiographic Image EnhancementFourier transformOtorhinolaryngologysymbolsbusinessAlgorithmSoftware
researchProduct

Comment on ``Friedel phases and phases of transmission amplitudes in quantum scattering systems" by T. Taniguchi and M. Buettiker

1999

We take a modified boundary condition at the dead end of a stub to simulate transmission zeroes being replaced by minima and then the discontinuous phase slip (or decrease) at the transmission zeroes are replaced by a continuous but rapid phase slip. The modified boundary condition can be continuously tuned to give the results of the stub with hard wall boundary condition at the dead end of stub. Even when the phase slip is continuous one can obtain information about the density of states in the stub region from the scattering phases.

Condensed Matter (cond-mat)FOS: Physical sciencesComputer Science::Software EngineeringCondensed MatterCondensed Matter::Mesoscopic Systems and Quantum Hall EffectComputer Science::Other
researchProduct

Quantum search of spatial regions

2003

Can Grover's algorithm speed up search of a physical region - for example a 2-D grid of size sqrt(n) by sqrt(n)? The problem is that sqrt(n) time seems to be needed for each query, just to move amplitude across the grid. Here we show that this problem can be surmounted, refuting a claim to the contrary by Benioff. In particular, we show how to search a d-dimensional hypercube in time O(sqrt n) for d at least 3, or O((sqrt n)(log n)^(3/2)) for d=2. More generally, we introduce a model of quantum query complexity on graphs, motivated by fundamental physical limits on information storage, particularly the holographic principle from black hole thermodynamics. Our results in this model include a…

Holographic principleDiscrete mathematicsQuantum PhysicsComputational complexity theoryFOS: Physical sciencesComputer Science::Software EngineeringGraph theoryGeneral Relativity and Quantum Cosmology (gr-qc)Unitary matrixUpper and lower boundsGeneral Relativity and Quantum CosmologyCombinatoricsHypercubeQuantum Physics (quant-ph)Black hole thermodynamicsQuantum computerMathematics44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
researchProduct

"Table 25" of "Search for photonic signatures of gauge-mediated supersymmetry in 8 TeV $pp$ collisions with the ATLAS detector"

2015

Acceptance-times-efficiency (a*e) for the photon+$\ell$ analysis SRs.

InclusiveP P --> WINO WINO X8000.0ACC*EFFProton-Proton ScatteringPhysics::Instrumentation and DetectorsPhysics::Plasma PhysicsPhysics::Medical PhysicsComputer Science::Software EngineeringPhysics::OpticsSUSYSupersymmetry
researchProduct

Deciding properties of integral relational automata

1994

This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.

Model checkingDiscrete mathematicsClass (set theory)TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESComputer scienceComputer Science::Software EngineeringDecidabilityUndecidable problemComputer Science::Multiagent SystemsCTL*TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESRelational calculusTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputer Science::Logic in Computer ScienceAutomata theoryTime complexityComputer Science::Formal Languages and Automata Theory
researchProduct

Dispersion relation formalism for virtual Compton scattering of the proton

2001

We present in detail a dispersion relation formalism for virtual Compton scattering (VCS) off the proton from threshold into the $\Delta(1232)$-resonance region. Such a formalism can be used as a tool to extract the generalized polarizabilities of the proton from both unpolarized and polarized VCS observables over a larger energy range. We present calculations for existing and forthcoming VCS experiments and demonstrate that the VCS observables in the energy region between pion production threshold and the $\Delta(1232)$-resonance show an enhanced sensitivity to the generalized polarizabilities.

PhysicsNuclear and High Energy PhysicsParticle physics/dk/atira/pure/sustainabledevelopmentgoals/affordable_and_clean_energyCompton scatteringFOS: Physical sciencesComputer Science::Software EngineeringObservableHigh Energy Physics - PhenomenologyFormalism (philosophy of mathematics)High Energy Physics - Phenomenology (hep-ph)PionQuantum electrodynamicsDispersion relationComputer Science::Networking and Internet ArchitectureEnhanced sensitivitySDG 7 - Affordable and Clean Energy
researchProduct

Coherent quantum evolution via reservoir driven holonomies.

2006

We show that in the limit of a strongly interacting environment a system initially prepared in a decoherence-free subspace (DFS) coherently evolves in time, adiabatically following the changes of the DFS. If the reservoir cyclicly evolves in time, the DFS states acquire a holonomy.

PhysicsQuantum decoherenceHolonomyGeneral Physics and AstronomyComputer Science::Software EngineeringQuantum evolutionComputer Science::PerformanceQuantum mechanicsHolonomieLimit (mathematics)Decoherence-free subspace (DFS)Quantum evolutionComputer Science::Data Structures and AlgorithmsSubspace topologyPhysical review letters
researchProduct

The Crane Beach Conjecture

2002

A language L over an alphabet A is said to have a neutral letter if there is a letter e/spl isin/A such that inserting or deleting e's from any word in A* does not change its membership (or non-membership) in L. The presence of a neutral letter affects the definability of a language in first-order logic. It was conjectured that it renders all numerical predicates apart from the order predicate useless, i.e., that if a language L with a neutral letter is not definable in first-order logic with linear order then it is not definable in first-order. Logic with any set /spl Nscr/ of numerical predicates. We investigate this conjecture in detail, showing that it fails already for /spl Nscr/={+, *…

Predicate logicDiscrete mathematicsIterated logarithmConjectureComputational complexity theoryDescription logicComputer Science::Logic in Computer ScienceComputer Science::Software EngineeringBinary numberSigmaPredicate (grammar)MathematicsProceedings 16th Annual IEEE Symposium on Logic in Computer Science
researchProduct